翻訳と辞書
Words near each other
・ "O" Is for Outlaw
・ "O"-Jung.Ban.Hap.
・ "Ode-to-Napoleon" hexachord
・ "Oh Yeah!" Live
・ "Our Contemporary" regional art exhibition (Leningrad, 1975)
・ "P" Is for Peril
・ "Pimpernel" Smith
・ "Polish death camp" controversy
・ "Pro knigi" ("About books")
・ "Prosopa" Greek Television Awards
・ "Pussy Cats" Starring the Walkmen
・ "Q" Is for Quarry
・ "R" Is for Ricochet
・ "R" The King (2016 film)
・ "Rags" Ragland
・ ! (album)
・ ! (disambiguation)
・ !!
・ !!!
・ !!! (album)
・ !!Destroy-Oh-Boy!!
・ !Action Pact!
・ !Arriba! La Pachanga
・ !Hero
・ !Hero (album)
・ !Kung language
・ !Oka Tokat
・ !PAUS3
・ !T.O.O.H.!
・ !Women Art Revolution


Dictionary Lists
翻訳と辞書 辞書検索 [ 開発暫定版 ]
スポンサード リンク

burst error : ウィキペディア英語版
burst error
In telecommunication, a burst error or error burst is a contiguous sequence of symbols, received over a data transmission channel, such that the first and last symbols are in error and there exists no contiguous subsequence of ''m'' correctly received symbols within the error burst.
The integer parameter ''m'' is referred to as the guard band of the error burst. The last symbol in a burst and the first symbol in the following burst are accordingly separated by ''m'' correct bits or more. The parameter ''m'' should be specified when describing an error burst.
For example, imagine sending a packet containing all of the letters of the alphabet, A through Z. If the recipient's computer "opens" the packet and finds that the first letter in the sequence is "Q" and the last letter in the sequence is "R," that is a burst error. The "burst" of data in the packet is corrupt.
Although in the example the first and last letters are defined as corrupt, that does not mean that every letter within the packet is damaged. Imagine that every other letter is as it should be; only position one, "A," and position 26, "Z," have been damaged. The number of correct bits of information between the damaged ends is called the guard band. In this case, the guard band would be 24, because there are 24 correct letters separating the two damaged ones.
==Channel model==

The Gilbert–Elliott model is a simple channel model introduced by Edgar Gilbert〔.〕 and E. O. Elliott 〔.〕 widely used for describing burst error patterns in transmission channels, that enables simulations of the digital error performance of communications links. It is based on a Markov chain with two states ''G'' (for good or gap) and ''B'' (for bad or burst). In state ''G'' the probability of transmitting a bit correctly is ''k'' and in state ''B'' it is ''h''. Usually,〔Lemmon, J.J.: Wireless link statistical bit error model. US National Telecommunications and Information Administration (NTIA) Report 02-394 (2002)〕 it is assumed that ''k'' = 1. Gilbert provided equations for deriving the other three parameters (''G'' and ''B'' state transition probabilities and ''h'') from a given success/failure sequence. In his example, the sequence was too short to correctly find ''h'' (a negative probability was found) and so Gilbert assumed that ''h'' = 0.5.

抄文引用元・出典: フリー百科事典『 ウィキペディア(Wikipedia)
ウィキペディアで「burst error」の詳細全文を読む



スポンサード リンク
翻訳と辞書 : 翻訳のためのインターネットリソース

Copyright(C) kotoba.ne.jp 1997-2016. All Rights Reserved.